Convex Hulls of Uniform Samples from a Convex Polygon
نویسندگان
چکیده
منابع مشابه
Convex Hulls of Point-Sets and Non-uniform Hypergraphs
For xed integers k 3 and hypergraphs G on N vertices, which contain edges of cardinalities at most k, and are uncrowded, i.e., do not contain cycles of lengths 2; 3, or 4, and with average degree for the i-element edges bounded by O(T i 1 (lnT )(k i)=(k 1)), i = 3; : : : ; k, for some number T 1, we show that the independence number (G) satis es (G) = ((N=T ) (lnT )1=(k 1)). Moreover, an indepe...
متن کاملRelative Convex Hull Determination from Convex Hulls in the Plane
A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and the problem of its determination in the plane is equivalent to find the shortest curve among all Jordan curves lying in the difference set of B and A and en...
متن کاملConvex hulls of spheres and convex hulls of disjoint convex polytopes
Given a set Σ of spheres in E, with d ≥ 3 and d odd, having a constant number of m distinct radii ρ1, ρ2, . . . , ρm, we show that the worst-case combinatorial complexity of the convex hull of Σ is Θ( ∑ 1≤i6=j≤m nin ⌊ d 2 ⌋ j ), where ni is the number of spheres in Σ with radius ρi. To prove the lower bound, we construct a set of Θ(n1+n2) spheres in E , with d ≥ 3 odd, where ni spheres have rad...
متن کاملFormalizing Convex Hulls Algorithms
We study the development of formally proved algorithms for computational geometry. The result of this work is a formal description of the basic principles that make convex hull algorithms work and two programs that implement convex hull computation and have been automatically obtained from formally verified mathematical proofs. A special attention has been given to handling degenerated cases th...
متن کاملConvex Hulls of Spatial Polygons with a Fixed Convex Projection
Let F be a convex n-gon in a horizontal plane of the Euclidean 3-space. Consider its spatial variation under which its vertices move vertically and let F be the convex hull of such a variation. In the general position, the boundary of F splits naturally into the "bottom" F 0 and the "top" F 00. The polyhedron F 0 (F 00) has triangular faces and no vertices inside. The projection of these faces ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2012
ISSN: 0001-8678,1475-6064
DOI: 10.1017/s0001867800005620